منابع مشابه
Term Rewrite Systems for Lattice Theory
The study of the equational theory of a class K of algebras and their free algebras FK(X) is greatly facilitated by a normal form for the terms over the language of K. For terms u and v over some set of variables X, u is equivalent to v modulo K if the equation u ≈ v holds identically in K (i.e., for all substitutions of the variables into all algebras in K). We write this u ≈ v (mod K). By a n...
متن کاملProof Theory at Work: Complexity Analysis of Term Rewrite Systems
In this article we introduce the notion of a generalized system of fundamental sequences and we define its associated slow-growing hierarchy. We claim that these concepts are genuinely related to the classification of the complexity—the derivation length— of rewrite systems for which termination is provable by a standard termination ordering. To substantiate this claim, we re-obtain multiple re...
متن کاملSemantics for Prolog via Term Rewrite Systems
• A submitted manuscript is the author's version of the article upon submission and before peer-review. There can be important differences between the submitted version and the official published version of record. People interested in the research are advised to contact the author for the final version of the publication, or visit the DOI to the publisher's website. • The final author version ...
متن کاملNon-connuent Term-rewrite Systems
The transfer component of a machine translation (MT) system typically comprises three aspects, namely the transfer structure used to transfer source into target structures, the (set of) transfer rules and the transfer process, which interpretes the set of transfer rules to derive the target from the source structure. The transfer structure can be formally considered as a term and the set of tra...
متن کاملTerm Equational Rewrite Systems and Logics
We introduce an abstract general notion of system of equations and rewrites between terms, called Term Equational Rewrite System (TERS), and develop a sound logical deduction system, called Term Equational Rewrite Logic (TERL), to reason about equality and rewriting. Further, we give an analysis of algebraic free constructions which together with an internal completeness result may be used to s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Symbolic Computation
سال: 1993
ISSN: 0747-7171
DOI: 10.1006/jsco.1993.1046